Parallel Smith-Waterman Algorithm for Gene Sequencing
ثبت نشده
چکیده
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system development for biological gene sequence. The research work here gives a deep understanding and knowledge transfer about exiting approach for gene sequencing and alignment using Smith-waterman their strength and weaknesses. Smith-Waterman algorithm calculates the local alignment of two given sequences used to identify similar RNA, DNA and protein segments. To identify the enhanced local alignments of biological gene pairs Smith-Waterman algorithm uses dynamic programming approach. It is proficient in finding the optimal local alignment considering the given scoring system.
منابع مشابه
Parallelization of Biological Gene Sequencing Technique with Optimized Smith Waterman Algorithm
The presented research work represent a highly robust and efficient parallel computing system development for biological gene sequencing. In this research work, the existing approaches has optimized the most optimum approach available till date in the form of Smithy Waterman algorithm for gene alignment or local gene sequencing. This paper mainly emphasizes on the system development for a trace...
متن کاملAutomatic Parallelization for Parallel Architectures Using Smith Waterman Algorithm
Gene sequencing problems are one of the predominant issues for researchers to come up with an optimized system model that could facilitate the optimum processing and efficiency without introducing overheads in terms of memory and time. This research is oriented towards developing such kind of system while taking into consideration of the dynamic programming approach called a Smith Waterman algo...
متن کاملStaircase Method: A Novel Method for Parallelizing S-W Algorithm
Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods are based on heuristics, which are fast but not sensitive. The Dynamic Programming Algorithm, Smith-Waterman, obtains the best alignment, but at the expense of computational time. Unfortunately, the inefficiency in the performance of the Smith-Waterman algorithm limits its applications i...
متن کاملA Novel Approach for Performance Improvement in Parallel Processing
With the high requirements of gene sequencing in the field of scientific research, it is essential to make faster sequencing process. The one of the main sequencing operation is done using Smith Waterman algorithm. This algorithm is used in two conventional ways to evaluate the matrix elements. They are i. Sequential processes ii. Conventional parallel processes. Since the work is to consider t...
متن کاملSSW Library: An SIMD Smith-Waterman C/C++ Library for Use in Genomic Applications
BACKGROUND The Smith-Waterman algorithm, which produces the optimal pairwise alignment between two sequences, is frequently used as a key component of fast heuristic read mapping and variation detection tools for next-generation sequencing data. Though various fast Smith-Waterman implementations are developed, they are either designed as monolithic protein database searching tools, which do not...
متن کامل